New generalized cyclotomic binary sequences of period $$p^2$$ p 2
نویسندگان
چکیده
منابع مشابه
On error linear complexity of new generalized cyclotomic binary sequences of period p2
We consider the k-error linear complexity of a new binary sequence of period p2, proposed in the recent paper “New generalized cyclotomic binary sequences of period p2”, by Z. Xiao et al., who calculated the linear complexity of the sequences (Designs, Codes and Cryptography, 2017, https://doi.org/10.1007/s10623017-0408-7). More exactly, we determine the values of k-error linear complexity over...
متن کاملAutocorrelation of New Generalized Cyclotomic Sequences of Period pn
Let n ≥ 2 be a positive integer and Z× n be the multiplicative group of the integer ring Zn. For a partition {Di|i = 0, 1, · · · , d − 1} of Z× n , if there exist elements g1, · · · , gd of Z× n satisfying Di = giD0 for all i where D0 is a multiplicative subgroup of Z× n , the Di are called generalized cyclotomic classes of order d. There have been lots of studies about cyclotomy with respect t...
متن کاملAbout the Linear Complexity of Ding-Hellesth Generalized Cyclotomic Binary Sequences of Any Period
We defined sufficient conditions for designing Ding-Helleseth sequences with arbitrary period and high linear complexity for generalized cyclotomies. Also we discuss the method of computing the linear complexity of Ding-Helleseth sequences in the general case.
متن کاملThe Linear Complexity of Whiteman’s Generalized Cyclotomic Sequences of Period
In this paper, we mainly get three results. First, let , be distinct primes with ; we give a method to compute the linear complexity of Whiteman’s generalized cyclotomic sequences of period . Second, if , we compute the exact linear complexity of Whiteman’s generalized cyclotomic sequences. Third, if , , and we fix a common primitive root of both and , then , which is a subgroup of the multipli...
متن کاملThe linear complexity of new binary cyclotomic sequences of period pn
In this paper, we determine the linear complexity of a class of new binary cyclotomic sequences of period pn constructed by Z. Xiao et al. (Des. Codes Cryptogr. DOI 10.1007/s10623-017-0408-7) and prove their conjecture about high linear complexity of these sequences.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2017
ISSN: 0925-1022,1573-7586
DOI: 10.1007/s10623-017-0408-7